منابع مشابه
Loop-erased Random Walks, Spanning Trees and Hamiltonian Cycles
We establish a formula for the distribution of loop-erased random walks at certain random times. Several classical results on spanning trees, including Wilson’s algorithm, follow easily, as well as a method to construct random Hamiltonian cycles.
متن کاملTopological paths, cycles and spanning trees in infinite graphs
We study topological versions of paths, cycles and spanning trees in infinite graphs with ends that allow more comprehensive generalizations of finite results than their standard notions. For some graphs it turns out that best results are obtained not for the standard space consisting of the graph and all its ends, but for one where only its topological ends are added as new points, while rays ...
متن کاملNetworks and Spanning Trees
In 1857 Arthur Cayley (1821–1895) published a paper [9] that introduces the term “tree” to describe the logical branching that occurs when iterating the fundamental process of (partial) differentiation. When discussing the composition of four symbols that involve derivatives, Cayley writes “But without a more convenient notation, it would be difficult to find [their] corresponding expressions ....
متن کاملSpanning Trees and Spanners
We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and low-dilation graphs.
متن کاملSpanning Trees in 2-trees
A spanning tree of a graph G is a connected acyclic spanning subgraph of G. We consider enumeration of spanning trees when G is a 2-tree, meaning that G is obtained from one edge by iteratively adding a vertex whose neighborhood consists of two adjacent vertices. We use this construction order both to inductively list the spanning trees without repetition and to give bounds on the number of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1991
ISSN: 0895-7177
DOI: 10.1016/0895-7177(91)90008-u